Singular Coverings and Non-Uniform Notions of Closed Set Computability
نویسندگان
چکیده
منابع مشابه
Singular Coverings and Non-Uniform Notions of Closed Set Computability
The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskĭı, Tsĕıtin, Kreisel, and Lacombe assert the existence of non-empty co-r.e. closed sets devoid of computable points: sets which are even ‘large’ in the sense of positive Lebesgue measure. We observe that a certain size is in fact necessary : every non-empty co-r.e. closed real set without ...
متن کاملNon-Uniform Comparison of Notions for Closed Set Computability of Fixed Cardinality with Applications to Singular Coverings
The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskĭı, Tsĕıtin, Kreisel, and Lacombe assert the existence of non-empty co-r.e. closed sets devoid of computable points: sets which are ‘large’ in the sense of positive Lebesgue measure. We observe that a certain size is in fact necessary: every non-empty co-r.e. closed real set of cardinality...
متن کاملNotions of computability at higher types III
Examples 1.2 (i) Let 1 be the singleton type world {⋆}, with ⋆ → ⋆ = ⋆×⋆ = ⋆). (ii) Let F (γ1, . . . , γr) be the set of finite or simple types, freely generated via × and → from the basic type names γ1, . . . , γr. Important examples are F (ι) and F (ι, o), where ι and o are thought of as the types of natural numbers and booleans respectively. (iii) Richer languages of types, for example as in...
متن کاملNotions of computability at higher types II
In Part I of this series of papers [Lon01a] we gave a historical survey of the study of notions of higher-type computability. In the present paper and its sequel [Lon01b], we undertake a more systematic exposition of notions of higher-type computability, showing how many of the existing ideas and results can be fitted into a coherent framework. In Part II we will restrict our attention to notio...
متن کاملNotions of Probabilistic Computability on Represented Spaces
We define and compare several probabilistic notions of computability for mappings from represented spaces (that are equipped with a measure or outer measure) into computable metric spaces. We thereby generalize definitions by [Ko 1991] and Parker (see [Parker 2003, Parker 2005, Parker 2006]), and furthermore introduce the new notion of computability in the mean. Some results employ a notion of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.03.009